#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int MAX_N = 1e6 + 5;
const int MAX_L = 20; // ~ Log N
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 7;
const double EPS = 1e-9;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;

#define LSOne(S) (S & (-S))
#define isBitSet(S, i) ((S >> i) & 1)

string str;
int n, num;
int tr[MAX_N][26], cnt[MAX_N]; // using trie

void insert(string s) {
    int u = 0;
    for (char c : s) {
        if (!tr[u][c - 'a']) tr[u][c - 'a'] = ++num;
        u = tr[u][c - 'a'];
    }
    cnt[u]++;
}

bool search(string s) {
    int u = 0;
    for (char c : s) {
        if (!tr[u][c - 'a']) return false;
        u = tr[u][c - 'a'];
    }
    return cnt[u];
}

void solve() {
    cin >> str >> n;
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        insert(s);
    }
    int m = str.size();
    int dp[m + 1] = {};
    dp[0] = 1;
    for (int i = 1; i <= m; i++) {
        int u = 0, j = i;
        for (char c : str.substr(i - 1)) {
            if (!tr[u][c - 'a']) break;
            u = tr[u][c - 'a'];
            if (cnt[u]) (dp[j] += dp[i - 1]) %= MOD;
            j++;
        }
    }
    cout << dp[m] << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int tc; tc = 1;
    for (int t = 1; t <= tc; t++) {
        //cout << "Case #" << t  << ": ";
        solve();
    }
}
